package lc_3038_相同分数的最大操作数目_I;

public class Solution {
    public int maxOperations(int[] nums) {
        int ans = 1, s = nums[0] + nums[1];
        for (int i = 2; i + 1 < nums.length && nums[i] + nums[i + 1] == s; i += 2, ans += 1) {
        }
        return ans;
    }
}